wz factorization via abay-broyden-spedicato algorithms
Authors
abstract
classes of abaffy-broyden-spedicato (abs) methods have been introduced for solving linear systems of equations. the algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. here, we show how to apply the abs algorithms to devise algorithms to compute the wz and zw factorizations of a nonsingular matrix as well as the $w^tw$ and $z^tz$ factorizations of a symmetric positives definite matrix. we also describe the qz and the qw factorizations, with q orthogonal, and show how to appropriate the parameters of the abs algorithms to compute these factorizations.
similar resources
WZ factorization via Abay-Broyden-Spedicato algorithms
Classes of Abaffy-Broyden-Spedicato (ABS) methods have been introduced for solving linear systems of equations. The algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. Here, we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW factorizations of a nonsingular matrix as well as...
full textwz factorization via abay-broyden-spedicato algorithms
classes of abaffy-broyden-spedicato (abs) methods have been introduced for solving linear systems of equations. the algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. here, we show how to apply the abs algorithms to devise algorithms to compute the wz and zw factorizations of a nonsingular matrix as well as...
full textOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
full textMarkowitz scheme for the sparse WZ factorization
In this paper the authors present problems which can appear when a sparse square matrix (without any special structure) is factorized to a product of matrices W and Z. The fill-in problem is considered, and the manners of its solving – by permuting both rows and columns with a modified Markowitz scheme among others. The results of numerical experiments for sparse matrices of various sizes are p...
full textSolving linear systems with vectorized WZ factorization
Abstract In the paper we present a vectorized algorithm for WZ factorization of a matrix which was implemented with the BLAS1 library. We present the results of numerical experiments which show that vectorization accelerates the sequential WZ factorization. Next, we parallelized both algorithms for a two-processor shared memory machine using the OpenMP standard. We present performances of these...
full textParallel WZ factorization on mesh multiprocessors
We present a parallel algorithm for the QIF (Quadrant Interlocking Factorization) method, which solves linear equation systems using WZ factorization. The parallel algorithm we developed is general in the sense that it does not impose any restrictions on the size of the problem and that it is independent from the dimensions oJ the mesh. The result is an efficient algorithm using half the messag...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyPublisher: iranian mathematical society (ims)
ISSN 1017-060X
volume 40
issue 2 2014
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023